OPTIMAL CACHE PLACEMENT FOR AN ACADEMIC BACKBONE NETWORK
نویسندگان
چکیده
منابع مشابه
Towards Generalized Optimal Cache Proxy Placement
A study on cache proxy placement for tree-based topology is presented in this paper. Web caching has been developed maturely to deal with burst increasing network traffic. Most existing works on web caching focus on contentbased issue. Some of the newly published papers discussed the placement of caches and presented algorithms to find out the optimal solution. However, they all assume constant...
متن کاملNew Directions for a Japanese Academic Backbone Network
This paper describes an architectural design and related services of a new Japanese academic backbone network, called SINET5, which will be launched in April 2016. The network will cover all 47 prefectures with 100-Gigabit Ethernet technology and connect each pair of prefectures with a minimized latency. This will enable users to leverage evolving cloud-computing powers as well as draw on a hig...
متن کاملOptimal Coded Multicast in Cache Networks with Arbitrary Content Placement
A new class of caching schemes, called coded caching can significantly reduce the communication bandwidth requirement for satisfying users’ demands by utilizing the multicasting gain among multiple users. Most existing works assume that the users follow the prescriptions for content placement made by the system. However, users in practice prefer to decide what files to cache or discard some par...
متن کاملAn Improved Cache Mechanism for a Cache-based Network Processor
Internet traffic has increased due to the development of richer web content and services. In particular, IP telephony, Messengers, and Twitter are composed of a large number of small packets, and these services are expected to increase. Thus, routers need to handle largebandwidth fine-grain communication. We proposed a network processor called P-Gear, which has a special cache mechanism that re...
متن کاملCompiler Controlled Cache Placement
This paper considers a novel approach for supporting parallel accesses to a data cache. We explore the possibility of explicitly managing cache accesses using a static compile-time analysis. First we perform a limit study on dynamic instruction traces to discover an upper bound on the amount of memory parallelism that is exploitable at compile time. Then we introduce compiler controlled split c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2018
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.61.197